package features.advance.leetcode.array.easy;

import java.util.Arrays;

/**
 * @author LIN
 * @date 2022-06-29 13:50
 *  344. 反转字符串
 *
 *  难度：简单
 *
 * 编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 s 的形式给出。
 *
 * 不要给另外的数组分配额外的空间，你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
 *
 *
 *
 * 示例 1：
 *
 * 输入：s = ["h","e","l","l","o"]
 * 输出：["o","l","l","e","h"]
 * 示例 2：
 *
 * 输入：s = ["H","a","n","n","a","h"]
 * 输出：["h","a","n","n","a","H"]
 *
 *
 * 提示：
 *
 * 1 <= s.length <= 105
 * s[i] 都是 ASCII 码表中的可打印字符
 */
public class Solution344 {

    public static void main(String[] args) {
        Solution solution = new Solution() {
        };
        char[] s = {'h','e','l','l','o'};
        solution.reverseString(s);
        System.out.println(Arrays.toString(s));
    }

    static class Solution {
        /**
         * 双指针
         * @param s
         */
        public void reverseString(char[] s) {
            for(int i=0;i<s.length/2;i++){
                char t = s[s.length-i-1];
                s[s.length-i-1] = s[i];
                s[i] = t;

            }
        }
    }
}
